Optimal Proof Systems and Complete Languages
نویسنده
چکیده
We investigate the connection between optimal propositional proof systems and complete languages for promise classes. We prove that an optimal propositional proof system exists if and only if there exists a propositional proof system in which every promise class with the test set in co-NP is representable. Additionally, we prove that there exists a complete language for UP if and only if there exists a propositional proof system such that UP is representable in it. UP is the standard promise class with the test set in co-NP.
منابع مشابه
Optimal Proof Systems for Propositional Logic and Complete Sets
A polynomial time computable function h : ! whose range is the set of tau-tologies in Propositional Logic (TAUT), is called a proof system. Cook and Reckhow deened this concept in 6] and in order to compare the relative strength of diierent proof systems, they considered the notion of p-simulation. Intuitively a proof system h p-simulates a second one h 0 if there is a polynomial time computabl...
متن کاملComplete Problems for Promise Classes by Optimal Proof Systems for Test Sets
We present a uniform approach to investigate the relationship between the existence of complete sets for promise classes and the existence of (p-)optimal proof systems for certain languages. Central to our approach is the notion of a test set which can be used to verify that a given nondeterministic polynomial-time machine obeys the promise on a given input. Basically, we show that a promise cl...
متن کاملOptimal Proof Systems and Sparse Sets
We exhibit a relativized world where NP ∩ SPARSE has no complete sets. This gives the first relativized world where no optimal proof systems exist. We also examine under what reductions NP ∩ SPARSE can have complete sets. We show a close connection between these issues and reductions from sparse to tally sets. We also consider the question as to whether the NP ∩ SPARSE languages have a computab...
متن کاملCharacterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise class C? For concrete languages L (such as TAUT or SAT) and concrete promise classes C (such as NP∩coNP, UP, BPP, disjoint NP-pairs etc.), these questions have been intensively studied during the last years, and a num...
متن کاملOptimal proof systems imply complete sets for promise classes
imply complete sets for promise classes Johannes Köblery, Jochen Messnerz and Jacobo Toránz yInstitut für Informatik, Humboldt-Universität zu Berlin, 10099 Berlin, Germany, zAbt. Theoretische Informatik, Universität Ulm Oberer Eselsberg, 89069 Ulm, Germany, A polynomial time computable function h : ! whose range is a set L is called a proof system for L. In this setting, an h-proof for x 2 L is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 15 شماره
صفحات -
تاریخ انتشار 2008